Directed update for the stochastic Green function algorithm

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Stochastic Green Function (SGF) algorithm

We present the Stochastic Green Function (SGF) algorithm designed for bosons on lattices. This new quantum Monte Carlo algorithm is independent of the dimension of the system, works in continuous imaginary time, and is exact (no error beyond statistical errors). Hamiltonians with several species of bosons (and one-dimensional Bose-Fermi Hamiltonians) can be easily simulated. Some important feat...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Green Edge Directed Demosaicing Algorithm

In recent years, digital cameras have become the dominant image capturing devices. They are now commonly included in other digital devices such as mobile phones and PDAs, and have become steadily cheaper, more complex and powerful. In such devices, in order to keep costs down, only incomplete color information is recorded at each pixel location. Interpolating a full three-color image by estimat...

متن کامل

Green Function Monte Carlo with Stochastic Reconfiguration

A new method for the stabilization of the sign problem in the Green Function Monte Carlo technique is proposed. The method is devised for real lattice Hamiltonians and is based on an iterative ”stochastic reconfiguration” scheme which introduces some bias but allows a stable simulation with constant sign. The systematic reduction of this bias is in principle possible. The method is applied to t...

متن کامل

A stochastic algorithm for function minimization

Focusing on what an optimization problem may comply with, the so-called convergence conditions have been proposed and sequentially a stochastic optimization algorithm named as DSZ algorithm is presented in order to deal with both unconstrained and constrained optimizations. Its principle is discussed in the theoretical model of DSZ algorithm, from which we present a practical model of DSZ algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2008

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.78.056707